# Author    :Dun_Hz
# Time      :2024/3/15 16:29
# 快速排序
def quick_sort(n):
    if len(n)<2:
        return n
    else:
        pivot = n[0]
        left = [x for x in n[1:] if x < pivot]
        right = [x for x in n[1:] if x > pivot]
    return quick_sort(left)+[x for x in n if x==n[0]]+quick_sort(right)

print(quick_sort([3,5,11,6,3,2,7,2,6]))